Kripke models and the (in)equational logic of the second-order λ-calculus

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kripke Models and the (in)equational Logic of the Second-order -calculus

We deene a new class of Kripke structures for the second-order-calculus, and investigate the soundness and completeness of some proof systems for proving inequalities (rewrite rules) as well as equations. The Kripke structures under consideration are equipped with preorders that correspond to an abstract form of reduction, and they are not necessarily extensional. A novelty of our approach is t...

متن کامل

Kripke Models and the (In)equational Logic of the Second-Order lambda-Calculus

We de ne a new class of Kripke structures for the second order calculus and investi gate the soundness and completeness of some proof systems for proving inequalities rewrite rules as well as equations The Kripke structures under consideration are equipped with preorders that correspond to an abstract form of reduction and they are not necessarily extensional A novelty of our approach is that w...

متن کامل

Kripke Models for the Second-Order Lambda-Calculus

We define a new class of Kripke structures for the second-order λ-calculus, and investigate the soundness and completeness of some proof systems for proving inequalities (rewrite rules) or equations. The Kripke structures under consideration are equipped with preorders that correspond to an abstract form of reduction, and they are not necessarily extensional. A novelty of our approach is that w...

متن کامل

RPO, Second-order Contexts, and λ-calculus

We apply Leifer-Milner RPO approach to the λ-calculus, endowed with lazy and call by value reduction strategies. We show that, contrary to process calculi, one can deal directly with the λ-calculus syntax and apply Leifer-Milner technique to a category of contexts, provided that we work in the framework of weak bisimilarities. However, even in the case of the transition system with minimal cont...

متن کامل

Models of λ-Calculus and the Weak MSO Logic∗

We study the Weak MSO logic in relationship to infinitary λ-calculus. We show that for every formula φ of Weak MSO there exists a finitary model of infinitary λ-calculus recognizing the set of infinitary λ-terms whose Böhm tree satisfies φ. The model is effective, in the sense that for every λY -term we can effectively compute its value in the model. In particular, given a finite λY -term, one ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 1997

ISSN: 0168-0072

DOI: 10.1016/s0168-0072(96)00039-5